Data-Parallel Molecular Dynamics with Neighbor-Lists
نویسنده
چکیده
We report on a data-parallel classical molecular dynamics algorithm and its implementation on Connection Machines CM-5 and CM-200 using CM-Fortran, a Fortran-90 dialect. A grid-based spatial decomposition of the atomic system is used for parallelization. Our previous algorithm on the CM's calculated all forces in the nearby region. A diierent algorithm using classical Verlet neighbor lists is more eecient, when implemented on the CM-5 with its indirect addressing hardware. The code has been used for extensive simulations on a 128-node CM-5E, and performance measurements are reported.
منابع مشابه
Parallel Molecular Dynamic Code for Large Simulations using Truncated Octahedron Periodics
The complete evaporation of three dimensional submicron droplets under both subcrit ical and supercritical conditions has been modeled using parallel molecular dynamics In this initial study the two phase simulations consist entirely of argon atoms The inter atomic forces are based on a Lennard Jones potential and the resultant atomic displacements are determined using a modi ed velocity Verlet...
متن کاملA Parallel Scalable Approach to Short-range Molecular Dynamics on the Cm-5
We present an scalable algorithm for short-range Molecular Dynamics which minimizes interprocessor communications at the expense of a modest computational redundancy. The method combines Verlet neighbor lists with coarse-grained cells. Each processing node is associated with a cubic volume of space and the particles it owns are those initially contained in the volume. Data structures for \own" ...
متن کاملImproved O(N) Neighbor List Method Using Domain Decomposition and Data Sorting
The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessary interatomic distance calculation in molecular simulations involving many atoms. Both of the serial and parallelized performance of molecular dynamics simulation are evaluated using the new algorithm and compared with those using the conventional Verlet table and cell-linked list algorithm. Resu...
متن کاملGPU-Optimized Coarse-Grained MD Simulations of Protein and RNA Folding and Assembly
Molecular dynamics (MD) simulations provide a molecular-resolution physical description of the folding and assembly processes, but the size and the timescales of simulations are limited because the underlying algorithm is computationally demanding. We recently introduced a parallel neighbor list algorithm that was specifically optimized for MD simulations on GPUs. In our present study, we analy...
متن کاملEfficient Parallelization of Short-Range Molecular Dynamics Simulations on Many-Core Systems
This article introduces a highly parallel algorithm for molecular dynamics simulations with short-range forces on single node multi- and many-core systems. The algorithm is designed to achieve high parallel speedups for strongly inhomogeneous systems like nanodevices or nanostructured materials. In the proposed scheme the calculation of the forces and the generation of neighbor lists are divide...
متن کامل